Divisible Blind Signatures Based on Hash Chains 1

This article presents an efficient divisible blind signature scheme that makes it possible to divide a blind signature with a specified value into a sequence of subsignatures with smaller values for a sequence of different designated verifications. In the proposed scheme every signature can be divided into subsignatures with arbitrary positive values as long as the total value of them is equal to the specified value of that signature. Furthermore, no time-consuming operations such as modular exponentiation operations and inverse computations are required for a user to obtain and verify a divisible blind signature in the protocol. In particular, the proposed scheme can be applied to many interesting communication services, such as anonymous scoring services, divisible electronic cash systems, and multi-recastable voting protocols.